منابع مشابه
Separating and Intersecting Properties of BCH and Kasami Codes
Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes.
متن کاملOblivious transfers and intersecting codes
Universit e de Montr eal y Claude Cr epeau z Universit e de Montr eal y Ecole Normale Sup erieure x Mikll os SS antha { Universit e Paris{Sud k Abstract Assume A owns t secret k{bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol f...
متن کامل- Covering Arrays and Intersecting Codes
A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rknyi, Katona, and Kleitman and Spencer. The present article is concerned with the case t = 3, where...
متن کاملOn separating codes
Let Γ be a code of length n, and (T,U ) a pair of disjoint subsets of Γ. We say that (T,U ) is separated if there exists a coordinate i, such that for any codeword (c1, . . . , cn) ∈ T and any codeword (c ′ 1, . . . , c ′ n) ∈ U , ci 6= c ′ i. The code Γ is (t,u)-separating if all pairs (T,U ) with #T = t and #U = u are separated. Separating codes (or systems) are known from combinatorics, and ...
متن کاملSeparating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00437-7